Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs
نویسندگان
چکیده
The connectivity and edge of interconnection network determine the fault tolerance network. An is usually viewed as a connected graph, where vertex corresponds processor link between two distinct processors. Given graph G with set V(G) E(G), if for any vertices u,v∈V(G), there exist min{dG(u),dG(v)} edge-disjoint paths u v, then strongly Menger connected. Let m be an integer m≥1. If G−Fe remains Fe⊆E(G) |Fe|≤m, m-edge-fault-tolerant |Fe|≤m δ(G−Fe)≥2, m-conditional edge-fault-tolerant In this paper, we consider n-dimensional bubble-sort star BSn. We show that BSn (2n−5)-edge-fault-tolerant n≥3 (6n−17)-conditional n≥4. Moreover, give some examples to our results are optimal.
منابع مشابه
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vert...
متن کاملEdge-bipancyclicity of star graphs under edge-fault tolerant
The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...
متن کاملEdge-connectivity of strong products of graphs
The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E(G2)|), λ(G2)(|V (G1)|+2|E(G1)|)}. In additi...
متن کاملFaithful 1-Edge Fault Tolerant Graphs
A graph G* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G’ contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can be easily verified that the Cartesian product graph G; x G; is l-edge fault tolerant with respect ...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.03.006